Two-player games : a reduction
نویسنده
چکیده
The complete proof is to be found in Vieille [4],[5]. The general idea of the proof is to deÞne a class of sets, the solvable sets, which can safely be thought of as absorbing states, and to construct ε-equilibrium proÞles such that the induced play reaches one of these sets with high probability, and remains there. Solvable sets are deÞned in Section 1. The organization of the proof is presented in Section 2. We shall use the tools introduced in a chapter by Solan [2].
منابع مشابه
Investigating the Effect of Rewards on Individual Players' Efforts: A Behavioral Approach
The main goal of the study is to examine the effect of rewards on the behavior of players in a team activity. In this framework, by performing 12 sequential and simultaneous games in a laboratory environment examine the rewarding effect on players' behavior. Students from Yazd universities surveyed and the sample of 182 students is in the form of two groups, which collected in total for 2184 ma...
متن کاملA TRANSITION FROM TWO-PERSON ZERO-SUM GAMES TO COOPERATIVE GAMES WITH FUZZY PAYOFFS
In this paper, we deal with games with fuzzy payoffs. We proved that players who are playing a zero-sum game with fuzzy payoffs against Nature are able to increase their joint payoff, and hence their individual payoffs by cooperating. It is shown that, a cooperative game with the fuzzy characteristic function can be constructed via the optimal game values of the zero-sum games with fuzzy payoff...
متن کاملA Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium
We present a direct reduction from k-player games to 2-player games that preserves approximate Nash equilibrium. Previously, the computational equivalence of computing approximate Nash equilibrium in k-player and 2-player games was established via an indirect reduction. This included a sequence of works defining the complexity class PPAD, identifying complete problems for this class, showing th...
متن کاملThe Complexity of Infinitely Repeated Alternating Move Games
We consider infinite duration alternating move games. These games were previously studied by Roth, Balcan, Kalai and Mansour [10]. They presented an FPTAS for computing an approximate equilibrium, and conjectured that there is a polynomial algorithm for finding an exact equilibrium [9]. We extend their study in two directions: (1) We show that finding an exact equilibrium, even for two-player z...
متن کاملThe Complexity of Alternating Move Games
We consider infinite duration alternating move games. These games were previously studied by Roth, Balcan, Kalai and Mansour [10]. They presented an FPTAS for computing an approximated equilibrium, and conjectured that there is a polynomial algorithm for finding an exact equilibrium [9]. We extend their study in two directions: (1) We show that finding an exact equilibrium, even for two-player ...
متن کاملحمایت نظام حقوق مالکیت فکری از حقوق بازیباز کنشگردر بازیهای رایانهای
Nowadays video games are fast becoming one of the most popular media of choice. For more than thirty years now video games are amongst us. At the start being a new form of entertainment for the youth only, in no time it has grown into a medium enjoyed and used for various purposes by consumers of all ages. The global market for video games is still expected to grow substantially in the upcoming...
متن کامل